Root square mean labelling of some graphs obtained from path

Further results on odd mean labeling of some subdivision graphs

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...

The Square Root Phenomenon in Planar Graphs

Square Graceful Labeling of Some Graphs

A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such that the induced mapping fp : E G → 1,4,9,... , q 2 defined by fp uv = f u − f v is an injection. The function f is called a square graceful labeling of G. In this paper the square graceful labeling of the caterpillar S X1,X2 ,... ,Xn , the graphs Pn−1 1,2,...n ,mK1,n ∪ ...

Computation of Root-Mean-Square Gains of Switched Linear Systems

In this paper we compute the root-mean-square (RMS) gain of a switched linear system when the interval between consecutive switchings is large. The algorithm proposed is based on the fact that a given constant γ provides an upper bound on the RMS gain whenever there is a separation between the stabilizing and the antistabilizing solutions to a set of γ-dependent algebraic Riccati equations. The...

Capacity of root-mean-square bandlimited Gaussian multiuser channels

Continuous-time additive white Gaussian noise channels with strictly time-limited and root-mean-square (RMS) bandlimited inputs are studied. RMS bandwidth is equal to the normalized second moment of the spectrum, which has proved to be a useful and analytically tractable measure of the bandwidth of strictly time-limited waveforms. The capacity of the single-user and two-user RMS-bandlimited cha...